Generalising Boundary Sets
نویسندگان
چکیده
This report proposes adaptable boundary sets as a new version-space representation. It is shown that adaptable boundary sets can be adjusted to a version-space representation between boundary sets [5, 6, 7] and instance-based boundary sets [11, 12, 13]. This allows the choice of proper version-space representations to be realised dynamically during the learning phase.
منابع مشابه
Generalising Conservativity
A constraint on functions from sets and relations to sets is studied. This constraint is a generalisation of the constraint of conservativity known from the study of generalised quantifiers in natural languages. It is suggested that this generalised constraint constitutes a semantic universal.
متن کاملSome points on generalized open sets
The paper is an attempt to represent a study of limit points, boundary points, exterior points, border, interior points and closure points in the common generalized topological space. This paper takes a look at the possibilities of an extended topological space and it also considers the new characterizations of dense set.
متن کاملThe Effect Of Spatial Generalisation On Filtering Noise For Spatio-Temporal Analyses
Spatial data sets do not only contain true information, there is also a certain amount of ‘noise’ associated with the data. The use of these data in spatio-temporal analyses, often results in a sub-optimal representation of reality. Generalising spatial data sets collected at different times may serve the purpose of filtering noise so that spatio-temporal change can be better elucidated. In thi...
متن کاملAssumption Sets for Extended Logic Programs
Generalising the ideas of [10] we define a simple extension of the notion of unfounded set, called assumption set, that applies to disjunctive logic programs with strong negation. We show that assumption-free interpretations of such extended logic programs coincide with equilibrium models in the sense of [13] and hence with the answer sets of [3, 4].
متن کاملGeneralisation and Domain Specific Functions in Genetic Programming
This research presents an evaluation of user defined domain specific functions of genetic programming using relational learning problems, generalisation for this class of learning problems and learning bias. After providing a brief theoretical background, two sets of experiments are detailed: experiments and results concerning the Monk-2 problem and experiments attempting to evolve generalising...
متن کامل